T-resolution: Refinements and Model Elimination II
نویسنده
چکیده
منابع مشابه
Asymptotic Refinements of a Misspecification-Robust Bootstrap for Generalized Method of Moments Estimators
I propose a nonparametric iid bootstrap that achieves asymptotic refinements for t tests and confidence intervals based on the generalized method of moments (GMM) estimators even when the model is misspecified. In addition, my bootstrap does not require recentering the bootstrap moment function, which has been considered as a critical procedure for bootstrapping GMM. The elimination of the rece...
متن کاملSome linear herbrand proof procedures : an analysis
Several Herbrand proof procedures proposed during the 1960 decade are shown to be related in varying degrees. Most of the paper deals with a relationship between s-linear resolution and model elimination. Refinements of each are proposed and the spaces of ground deductions are shown to be isomorphic in a suitable sense. The two refined procedures are then studied at the general level where they...
متن کاملResolution Refinements for Cut-Elimination based on Reductive Methods
Traditional reductive cut-elimination and CERES seem to be methods of entirely different nature and hence hard to compare. This short paper describes ongoing research that aims at comparing and possibly combining them in ways that retain that best features of each method.
متن کاملExtracting Inheritance Hierarchies from Prolog Programs: A System Based on the Inference of Type Relations
Consistency Checking of Automata Functional Specifications p. 76 Yet Another Application for Toupie: Verification of Mutual Exclusion Algorithms p. 86 Parsing with DCG-Terms p. 98 A First Order Resolution Calculus with Symmetries p. 110 Ordered Paramodulation and Resolution as Decision Procedure p. 122 Static Analysis of Prolog with Cut p. 134 A New Type Theory for Representing Logics p. 146 Ve...
متن کاملResolution Decision Procedures for the Guarded Fragment with Transitive Guards
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obtain a decision procedure for the guarded fragment with transitive guards. Another contribution of the paper is a special scheme notation, that allows to describe saturation strategies and show their correctness in a c...
متن کامل